Non-convex onion-peeling using a shape hull algorithm
نویسندگان
چکیده
منابع مشابه
Non-convex onion-peeling using a shape hull algorithm
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملConvex Hull Asymptotic Shape Evolution
The asymptotic properties of Rapidly exploring Random Tree (RRT) growth in large spaces is studied both in simulation and analysis. The main phenomenon is that the convex hull of the RRT reliably evolves into an equilateral triangle when grown in a symmetric planar region (a disk). To characterize this and related phenomena from flocking and swarming, a family of dynamical systems based on incr...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملSearch Convex Hull Algorithm
This note concerns the computation of the convex hull of a given set P = {p1, p2, . . . , pn} of n points in the plane. Let h denote the size of the convex hull, ie the number of its vertices. The value h is not known beforehand, and it can range anywhere from a small constant to n. We hav e already seen that any convex hull algorithm requires at least Ω(n lg n) time in the worst case, and have...
متن کاملPartial shape matching using convex hull and Fourier descriptors
An application of Fourier descriptors and convex hull for shape analysis is presented. Convex hull is used for dividing a shape into small parts. Amplitude spectrum which is invariant to scaling, translation and choosing a starting point is obtained from the Fourier descriptors (see e.g [1-3]) and used for comparison. All calculations are performed with the author's software and some algorithms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 2004
ISSN: 0167-8655
DOI: 10.1016/j.patrec.2004.05.015